| Definitions | s = t, x:A  B(x),  x:A. B(x), x:A  B(x), a:A fp B(a), type List, X(e), [], if b then t else f fi , E, {x:A| B(x)} , [car / cdr], as @ bs, mapfilter(f;P;L), concat(ll), <a, b>, t  T, strong-subtype(A;B), P   Q, ES, Type, AbsInterface(A),  b, es-le-before(es;e), es-interface-history(es;X;e), False,  A, ff, first(e),  ,  ,  b, P & Q, P  Q, p =b q, i <z j, i  z j, (i = j), x =a y, null(as), a < b, f(a), x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, a = b, deq-member(eq;x;L), p q, p  q, p  q, tt,  , Unit, left + right, map(f;as), e X, E(X), let x,y = A in B(x;y), t.1, case b of inl(x) => s(x) | inr(y) => t(y), Top, Void,  x:A.B(x), f  g, f(x)?z, loc(e), vartype(i;x), state@i, P Q, State(ds), State(ds), x dom(f), {T}, EqDecider(T), IdLnk, Id, EOrderAxioms(E; pred?; info), EState(T), Knd,   x. t(x), x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r s, constant_function(f;A;B), s ~ t |